Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments
نویسندگان
چکیده
منابع مشابه
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
Here we discuss the lot sizing problem of product returns and remanufacturing. Let us consider a forecast of demands and product returns over a finite planning horizon — the problem is to determine an optimal production plan. This consists of either manufacturing new products or remanufacturing returned units, and in this way meets both demands at minimum costs. The costs of course are the fixe...
متن کاملCoordinated Capacitated Lot-Sizing Problem with Dynamic Demand: A Lagrangian Heuristic
Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed-integer programming formulation and Lagrangian relaxation solution procedur...
متن کاملHeuristic-based neural networks for stochastic dynamic lot sizing problem
Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained wit...
متن کاملFix and Relax Heuristic for a Stochastic Lot-Sizing Problem
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried out on a large set of instances have s...
متن کاملA heuristic to solve the dynamic lot sizing problem with supplier selection and quantity discounts
In the present study, the single-item dynamic lot sizing problem with supplier selection is investigated. The problem is broken down into two different cases. In the first case, quantity discounts are not taken into account; in the second case, incremental and all-unit quantity discounts are considered. Due to the complexity of the problems, a new heuristic is developed, which is based on the F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 1994
ISSN: 0894-069X,1520-6750
DOI: 10.1002/1520-6750(199403)41:2<273::aid-nav3220410210>3.0.co;2-v